Integer programming on domains containing inseparable ordered pairs
نویسندگان
چکیده
منابع مشابه
Integer Programming on Domains Containing Inseparable Ordered Pairs
Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend the analysis of the preference domains containing an inseparable ordered pair, initiated by Kalai and Ritz (1978). We show that these domains admit not only Arrovian social welfare functions “without ties,” but also Arrovian social welfare functions “with ties,” since they satisfy the strictly deco...
متن کاملOn Bounded Integer Programming
We present an efficient reduction from the Bounded integer programming (BIP) to the Subspace avoiding problem (SAP) in lattice theory. The reduction has some special properties with some interesting consequences. The first is the new upper time bound for BIP, poly(ϕ) · n n+o(n) (where n and ϕ are the dimension and the input size of the problem, respectively). This is the best bound up to now fo...
متن کاملTractable Constraints on Ordered Domains
Finding solutions to a constraint satisfaction problem is known to be an NP-complete problem in general, but may be tractable in cases where either the set of allowed constraints or the graph structure is restricted. In this paper we identify a restricted set of contraints which gives rise to a class of tractable problems. This class generalizes the notion of a Horn formula in propositional log...
متن کاملOn Ordered Domains of Integrity
In a recent paper,1 T. Szele proved that a division ring D is orderable if and only if the additive and multiplicative semigroup 5 generated by the nonzero squares of elements of D does not contain the zero element of D. The present paper extends this result to a domain of integrity K. Let us denote by K* the set of nonzero elements of K. The domain of integrity K is said to be orderable if and...
متن کاملBoolean Functions with Ordered Domains in Answer Set Programming
Boolean functions in Answer Set Programming have proven a useful modelling tool. They are usually specified by means of aggregates or external atoms. A crucial step in computing answer sets for logic programs containing Boolean functions is verifying whether partial interpretations satisfy a Boolean function for all possible values of its undefined atoms. In this paper, we develop a new methodo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Research in Economics
سال: 2018
ISSN: 1090-9443
DOI: 10.1016/j.rie.2018.08.001